Permuted scaled matching
نویسندگان
چکیده
منابع مشابه
Permuted function matching
We consider the combination of function and permuted matching, each of which has fast solutions in their own right. Given a pattern p of length m and a text t of length n, a function match at position i of the text is a mapping f from Σp to Σt with the property that f(pj) = ti+j−1 for all j. We show that the problem of determining for each substring of the text, if any permutation of the patter...
متن کاملPosition Heaps for Permuted Pattern Matching on Multi-Track String
A multi-set of N strings of length n is called a multi-track string. The permuted pattern matching is the problem that given two multi-track strings T = {t1, . . . , tN} of length n and P = {p1, . . . , pN} of length m, outputs all positions i such that {p1, . . . , pN} = {t1[i : i+m−1], . . . , tN [i : i+m−1]}We propose two new indexing structures for multi-track stings. One is a time-efficien...
متن کاملMaximizing Rigidity: Optimal Matching under Scaled-Orthography
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two different computational processes. We propose a new method for solving the correspondence problem between points of a fully uncalibrated scaled-orthographic image sequence. Among all possible point selections and permutati...
متن کاملEfficient One Dimensional Real Scaled Matching
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision. In this paper, we present a new, more precise and realistic, definition for one dimensional real scaled matching, and an efficient alg...
متن کاملHead Pose Estimation using Adaptively Scaled Template Matching
This paper proposes a real-time head pose estimation system usinga new image matchingtechnique. The system consists ofa trainingstage,in which subspace dictionaries for classifyinghead poses are computed using template matchingand the factorization method, and a recognition stage,in which head poses are estimated usingthe subspace method. The system uses the method ofadaptivelyscaled template m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.02.036